Quantum Algorithms for Matrix Multiplication
نویسنده
چکیده
This talk will describe recent progresses in the development of quantum algorithms for matrix multiplication. I will start with the case of Boolean matrices, and discuss the time complexity and query complexity of Boolean matrix multiplication in the quantum setting. I will then focus on other kinds of matrix products, in particular matrix products over algebraic structures known as semirings (such as the distance matrix product or the max-min matrix product), and describe new quantum algorithms, which are faster than the best known classical algorithms, for some of these products. Finally I will present several open problems related to the complexity of matrix multiplication. Part of this talk will be based on a recent joint work with Harumichi Nishimura.
منابع مشابه
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملQuantum Algorithms for Matrix Multiplication and Product Verification
Quantum algorithms for matrix multiplication and product verification Name: Robin Kothari, Ashwin Nayak Affil./Addr. 1: David R. Cheriton School of Computer Science, and Institute for Quantum Computing, University of Waterloo Affil./Addr. 2: Department of Combinatorics and Optimization, and Institute for Quantum Computing, University of Waterloo
متن کاملImproved output-sensitive quantum algorithms for Boolean matrix multiplication
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our results show that the product of two n× n Boolean matrices can be computed on a quantum computer in time Õ(n3/2+nl3/4), where l is the number of non-zero entries in the product, improving over the outputsensitive quantum a...
متن کاملTask-Based Algorithm for Matrix Multiplication: A Step Towards Block-Sparse Tensor Computing
Distributed-memory matrix multiplication (MM) is a key element of algorithms in many domains (machine learning, quantum physics). Conventional algorithms for dense MM rely on regular/uniform data decomposition to ensure load balance. These traits conflict with the irregular structure (block-sparse or rank-sparse within blocks) that is increasingly relevant for fast methods in quantum physics. T...
متن کاملThe border support rank of two-by-two matrix multiplication is seven
We show that the border support rank of the tensor corresponding to two-by-two matrix multiplication is seven over the complex numbers. We do this by constructing two polynomials that vanish on all complex tensors with format four-by-four-by-four and border rank at most six, but that do not vanish simultaneously on any tensor with the same support as the two-by-two matrix multiplication tensor....
متن کامل